range query
英 [reɪndʒ ˈkwɪəri]
美 [reɪndʒ ˈkwɪri]
网络 区域查询; 范围搜索; 范围查询; 区间查询; 进行范围查询
双语例句
- For instance, it is common to use a range query to find all documents that occurred last year or last month.
例如，通常使用范围查询来查找发生在过去一年或上一个月的所有文档。 - In a range query ( or filter), the user states the need to restrict all searched documents to be between two values that have a natural sorting.
在范围查询（或过滤器）中，用户声明需要将所有搜索到的文档限制在使用自然排序的两个值之间。 - This paper proposes a new method, named range query stream method.
提出一种处理区域查询流的新方法。 - High-dimensional Spatial Range Query Algorithm Based on Z Curve
一种采用Z曲线高维空间范围查询算法 - By using the grid index built for multiple queries, a multithreading continuous multiple range query algorithm is proposed based on uniform partition of the moving objects in memory.
提出了基于移动对象数据均匀划分的多线程连续多范围查询处理算法，该算法以为查询建立的格网索引为基础。 - A P2P Framework for Supporting Multi-Dimensional Range Query
一种支持多维数据范围查询的对等计算索引框架 - An Efficient Window-Based Range Query Algorithm in P2P
一种高效的P2P环境中的窗口查询算法 - Study on Processing Probabilistic RFID Spatial Range Query Based on Mobile Readers
基于移动阅读器的RFID概率空间范围查询技术的研究 - Research on Time Slice Query and Spatio-Temporal Range Query in Spatio-Temporal Databases
时空数据库瞬时查询和时空范围查询研究 - Range Query of High-Dimensional Data on Chord Based on Bit-Code and Distance
利用分区和距离实现Chord中高维数据范围检索 - Based on Z curve, the paper presents a method of grid partition, a procedure of partitioning search region, and a high-dimensional spatial range query algorithm.
利用Z曲线聚类和降维特性，本文给出网格划分方法、搜索区域分解过程，提出一种高维空间范围查询算法。 - There are many efficient algorithms for keyword query in peer-to-peer storage architecture, but few for numeric range query.
其中对连续有序数据的查询还没有有效的算法。 - A Probabilistic Model Based Predictive Spatio-Temporal Range Query Processing
一种基于概率模型的预测性时空区域查询处理 - An approach of efficiently answering such "Top N" queries is to map it into a single range query with the existing statistics on the relational DBMS.
回答这类TopN查询的一种快速有效的方法是利用数据库系统原有的统计信息，将TopN查询映射为一个范围查询。 - It was proved that the method guaranteed no false dismissals and proposed the range query algorithm and nearest neighbor query algorithm.
证明了此匹配方法不会产生漏报，给出了基于DTW距离的范围查询算法和近邻查询算法。 - Range Query, All-pairs Query and Nearest Neighbor Searches are all realized in this dissertation.
本文的相似性搜索问题在指定查询序列搜索、匹配序列对搜索和最近邻搜索三种情况下都得到了实现。 - Moreover, a new indexing structure or MS-tree is designed with a new filtering strategy applied to the range query of ML-tree.
而且，设计了一种新的高维索引结构MS-tree，并将新的过滤策略运用于MS-tree的范围查询。 - Both the theoretic analysis and the simulation experiments show that it has higher efficiency in spatial range query than Chord.
理论分析及仿真实验都显示该方法在执行空间范围查询操作时较Chord协议具有更高的效率。 - Euclidean distance is used as similarity measurement. Range query and k nearest neighbor query algorithms are presented.
然后用多维索引结构R树存储这些特征向量，将欧几里德距离作为相似尺度，在此基础上实现了范围查询和k近邻查询。 - According to the indexing structure, the time slice query algorithm and spatio-temporal range query algorithm are proposed, and the performance evaluation is given.
同时在该索引结构的基础上进行了瞬时查询和时空范围查询的研究，结合查询窗口扩展策略提出查询算法，性能评价表明与现有技术相比较该算法提高了系统的查询性能。 - As the basal functions of the geo-spatial database system, the paper gives the parallel design and parallel implementation of the two basal geo-spatial operations in the parallel geo-spatial database system, that is, the parallel geo-spatial range query and the parallel geo-spatial join.
空间操作是空间数据库的基本功能，本文给出了并行空间数据库中两种最为基础的空间操作的并行化设计与实现方法，即并行空间范围查询和并行空间连接操作。 - The proposed Bora algorithm partial resolved the transmission and aggregation problem of range query result in grid-like distributed network environment. But for neighbor queries and concurrent queries, the efficiency can be further improved.
Bora算法的提出部分解决了查询结果在类网格网络环境下的传输局限，但就近邻查询以及并发查询等环境下，其效率还存在着进一步提升的可能与必要。 - Based on this structure, we can achieve multi-keywords query and range query for video resources quickly and efficiently.
基于此结构，可以高效、快速地实现视频资源的多属性查询和范围查询。 - This dissertation does some research and comparison on the existing indexing and querying method, and uses the Buddy-tree that is suitable for the research of time slice and spatio-temporal range query.
本文对已存在的索引结构和查询方法进行了研究总结和比较，采用Buddy树进行瞬时查询和时空范围查询的研究。 - The brand new range query algorithm is proposed.
给出了全新的区域查询算法。 - Meanwhile the problems of range query, nearest query and k nearest query are studied by the defined order relations between spatial objects. By generalizing the methods, the nearest neighbor of planar line segments of spatial database is researched.
同时，利用定义的空间目标间的序关系研究了区域查询问题、最近邻查询问题、k最近邻查询问题，将其方法进行扩展研究了空间数据库平面线段的最近邻问题。 - This paper proposed histogram-based cost model on P2P-based spatio-temporal index range query, which can build cost models for different P2P-based spatio-temporal index.
本文提出了基于直方图技术的对等时空索引范围查询代价建模方法，能够对满足适用条件的不同类型的对等时空建立代价模型，具有较强的通用性。 - But when grid tends towards practicality from research of basic theory, the grid systems put forward advanced requests on grid resource discovery. For example, the ability of extensive, request based on attributes, range query, and so on.
在网格从基础理论研究阶段逐渐走向应用阶段的今天，网格系统对网格资源发现提出了新的要求，如可扩展性，基于属性查找，范围查找等。 - On this basis, the ciphertext query methods based on database ciphertext numerical range classifier and sequence based key hash propose, which can be a good solution to the equivalent of query and range query.
在此基础上提出了，提出了基于数值型密文划分器和密钥散列序列的密文检索方式，这种方式能很好的解决等值检索和范围检索。 - The partition rule related to the orders is set up, with which the spatial index structure is created, and the range query algorithm is given.
建立了划分规则，给出了对应的空间索引结构、该结构上的区域查询算法。